It speed the convergence of algorithm by the strong local searching of the Simulated Annealing Algorithm, and also increase the reliability of finding the whole optimal solution. 利用模拟退火算法较强的局部搜索能力,加快了算法的收敛速度,同时也提高了得到的全局最优解的可靠性。
Because genetic algorithm obtains local optimal solution at times, an approach was advanced that incorporates simulated annealing into genetic algorithm to improve the performance of genetic algorithm. An annealing operation is added and can improve the convergence rate evidently in multiple sequence alignment. 针对遗传算法容易陷入局部最优解的缺点,提出模拟退火算法与遗传算法相结合的思想,在遗传操作中加入退火操作,可明显提高多序列比对进化后期的收敛速度。
According to the principle of escaping from local optimal solutions of simulated annealing algorithm, a new neural computing method for optimization is proposed based on Hopfield neural network method. 本文在Hopfield神经网络优化方法的基础上,根据模拟退火算法逃离局部最优解的原理,提出了一种神经网络优化计算的新方法。
The reasons of cold-strip steel local bonding in cover annealing process is analysed. 对冷轧带钢在罩式炉退火过程中带卷产生局部粘结的原因进行了分析。
Taking into account the local optimization of some QoS routing algorithms, this paper introduced a new combinatorial optimization algorithm, which combines the simulated annealing and k-shortest path algorithm. 为解决QoS路由算法容易陷入局部最优的问题,将模拟退火方法与路由计算结合起来,提出一种新的组合优化算法。
The results of simulated experiments show that the stereo matching can be obtained. It is possible to escape from local minimum by simulated annealing, and the energy function can reach the global minimum. 模拟实验结果表明,使用模拟退火算法,可使能量函数达到全局最小,从而实现立体匹配。
For the convenience of explaining the advantage of genetic algorithm, we compared the results of numerical optimization and traveling salesman using genetic algorithm with the ones using local search strategy and simulated annealing. 为了便于说明遗传算法的优越性,分别将对数值优化和旅行商问题的计算结果与用局域搜索法和模拟退火得出的优化结果进行比较。
By optimizing some typical algebraic equations with many local minima, the presented method is compared with simulated annealing method, powell method and PSAM method. Simulating results illustrate that the algorithm presented in this paper is very effective, stable and reliable. 最后通过对一些典型的多极值方程进行优化,比较了APSAM方法与模拟退火法、POWELL法和PSAM方法的优化结果,仿真结果说明提出的算法优化能力较强,效果稳定可靠。
Having both local search capability of simulated annealing and global search capability of genetic algorithm, this simulated annealing genetic algorithm combines simulated annealing with genetic algorithms to improve the performance of software test data generation. 该算法针对测试数据自动生成的特点将遗传算法和模拟退火有机结合,充分发挥遗传算法的全局搜索和模拟退火的局部搜索优势,提高了测试数据的生成能力。
The system uses adaptive network structure adjustment techniques to improve the generalization capability of the network. At the same time, to keep the network from getting into local minimum the system uses simulated annealing with feature of global optimize to adjust the network weight. 在网络构造上,文章采用了自适应的网络结构调整技术,提高了网络的泛化能力,同时,在网络权值调节上采用了具有全局优化的模拟退火算法,避免了陷入局部极小的缺陷。
The local behavior of the unwrapped phase is approximated by a plane. The parameters of the plane are optimized by simulated annealing. 此方法对主值相位图采用局部平面近似,用模拟退火算法求出最优化平面参量,从而得到去除噪声和2π相位跳变的真实相位图。
The Application of Global Evolution Local Simulation Annealing Algorithm to Automobile Structure Parameters Optimization 全局演化局部模拟优化技术在汽车结构参数优化中的应用
To improve performance of original particle swarm optimization ( PSO) algorithm and avoid trapping to local minima, the paraller PSO based on simulated annealing ( SA) is proposed. 针对粒子群优化(PSO)容易陷入局部极小,提出将模拟退火(SA)引入并行PSO算法。
A novel hybrid evolutionary algorithm is proposed to solve the problems of function and combinatorial optimization. The algorithm is combined with local search algorithm and evolutionary strategy with simulated annealing algorithm. 提出将模拟退火、演化策略和局部搜索算法相结合的混合演化算法,以解决函数优化与组合优化问题。
For optimizing high-dimension complex functions, the classical optimization algorithms have the problems of high sensitivity to initial guess and local convergence, while the intelligent optimization algorithms such as Simulated Annealing ( SA) have the limitations of high computational costs and premature. 对于高维复杂函数优化问题,经典的优化算法存在着初始点敏感、局部收敛等问题;而模拟退火算法等智能算法则有着计算成本高昂、算法早熟等缺陷。
Regarding the characters of this class of problems, we add the local minimum to the simulated annealing algorithm. 针对这类问题,本文给出了一类改进的模拟退火算法,将局部极小化过程引入模拟退火算法。
Classical least-mean-square method and simplex method are easy to be trapped in local minimum, and the searching process of pure simulated annealing is rather long. Pure genetic algorithm is easy to be premature convergent. 传统最小二乘法和单纯形法易陷入局部极小,而单一模拟退火算法搜索过程冗长,单一遗传算法易早熟收敛。
Then a genetic simulated annealing based discovery algorithm is developed to find the high-performance topology in the whole network. The algorithm makes use of convergence acceleration of genetic algorithms and avoids local optimum of simulated annealing. 采用遗传模拟退化算法进行拓扑发现,充分利用遗传算法加快收敛,模拟退火算法避免陷入局部最优,从而快速获得全网拓扑结构。
The combination of the local convergence of PSO and the global convergence of simulated annealing effectively overcome the premature convergence of particle swarm algorithm and accelerate the convergence speed. 4. 通过微粒群局部收敛性与模拟退火全局收敛性的融合,有效的克服了微粒群算法的早熟收敛现象,加快收敛速度。
Inspired by the idea of greedy strategy and Tabu Search algorithm, we design two local search strategies named one-way search and traversal search, and combine them with Simulate Annealing algorithm to solve timetabling problems. 本文利用贪心和禁忌搜索的思想,提出了遍历搜索和定向搜索这两种邻域搜索策略,并在其基础上结合模拟退火,设计出了一个较为通用的二阶段课表安排算法。
To make the results optimized and escape from the trap of local minimum, the simulated tempering annealing ( STA) strategy is adopted. 为了使得结果最优同时又避免陷入局部最小的陷阱,采用了模拟回火退火方法进行最优估计。
To improve the local search ability, the orthogonal wavelet transform blind equalization algorithm based on the optimization of simulated annealing genetic algorithm is proposed in this dissertation. 提出了基于模拟退火遗传算法优化的正交小波盲均衡算法。
To avoid the PSO trapping into local optimization and accelerate the rate of convergence, this paper upgrades the PSO algorithm through integrating the Tabu Search and Simulated Annealing algorithm based on PSO algorithm, in which adopt convergence factor and index decreasing strategy of inertia weight. 为克服其可能陷入局部极值,提高收敛速度,本文在基本粒子群优化算法的基础上,结合禁忌搜索和模拟退火算法的思想对算法进行了改进,并引入了指数递减惯性权值和收敛因子。
This hybrid algorithm inherits the advantages of two algorithms, at the same time, avoids poor local optimization of the genetic algorithm and solves inefficient of the simulated annealing algorithm. 该算法继承了遗传算法及模拟退火算法的优点,同时又克服了遗传算法局部寻优较差及模拟退火算法求解效率较低的问题,是一种非常适合求解设备布局问题的算法。
For the population in stagnation, the catastrophic genetic annealing algorithm uses catastrophic operation to reinitialize part of worse individuals so as to jump out of a local optimum; while the adaptive chaos genetic annealing introduces adaptive chaos technique to optimize worse fitness individuals for better population diversity. 对处于停滞状态的种群,灾变遗传退火算法使用灾变操作重新初始化部分较差个体,跳出局部极值;而自适应混沌遗传退火则引入自适应混沌方法优化适应度较差个体,增加种群多样性。
For the energy minimization problem, traditional methods are sometimes use gradient decent and simulated annealing to solve and so on. However, gradient descent often falls into local minimum, and simulated annealing often has much longer convergence. 对于能量最小化问题,传统的方法主要采用梯度下降法和模拟退火法等优化方法来求解,然而梯度下降法常会陷入局部最小,而模拟退火法通常收敛时间较长。
According to SA have the local searching optimization ability and the disfigurement of GA, the union of the two algorithms could realize the predominance. So we design an arithmetic named Simulate Annealing hybrid Genetic Algorithms to solve this problem. 由于模拟退火算法局部寻优的能力以及遗传算法固有的缺陷,二者的结合正好实现了优势互补,从而设计了模拟退火混合遗传算法对该问题进行求解。